A Comparison of Five Implementations of 3D Delaunay Tessellation
نویسندگان
چکیده
When implementing Delaunay tessellation in 3D, a number of engineering decisions must be made about update and location algorithms, arithmetics, perturbations, and representations. We compare five codes for computing 3D Delaunay tessellation: qhull, hull, CGAL, pyramid, and our own tess3, and explore experimentally how these decisions affect the correctness and speed of computation, particularly for input points that represent atoms coordinates in proteins.
منابع مشابه
Delaunay Tessellation of Proteins: Four Body Nearest-Neighbor Propensities of Amino Acid Residues
Delaunay tessellation is applied for the first time in the analysis of protein structure. By representing amino acid residues in protein chains by C alpha atoms, the protein is described as a set of points in three-dimensional space. Delaunay tessellation of a protein structure generates an aggregate of space-filling irregular tetrahedra, or Delaunay simplices. The vertices of each simplex defi...
متن کاملEfficient Computation of 3D Clipped Voronoi Diagram
The Voronoi diagram is a fundamental geometry structure widely used in various fields, especially in computer graphics and geometry computing. For a set of points in a compact 3D domain (i.e. a finite 3D volume), some Voronoi cells of their Voronoi diagram are infinite, but in practice only the parts of the cells inside the domain are needed, as when computing the centroidal Voronoi tessellatio...
متن کاملUsing Delaunay triangulations to investigate the effect of interparticle friction on critical-state DEM simulations
It is now broadly accepted that failure in a granular material is dominated by buckling failure of strong force chains oriented in the direction of the major principal stress [1]. A recent parametric study [2] sheared granular soils, simulated using the discrete element method (DEM), to critical state using different values of interparticle friction coefficient (μ). The stability of the strong ...
متن کاملCoping with Numerical Problems in Implementation of 3d Delaunay Triangulation
In this paper we present our experience with the solution how to make the implementation of 3D Delaunay triangulation more stable. A brief overview of possible methods is given. The proper solution is found in geometric predicates. Tests of two different implementations of them are provided and results of incorporating one of them into our implementation of 3D Delaunay triangulator are presente...
متن کاملAn Automatic Adaptive Reenement and Dereenement Method for 3d Elliptic Problems
We present the theory and implementation for a new automatic adaptive h-re nement and -dere nement method for twoand three-dimensional elliptic problems. An exact lower error bound for dere nement is obtained theoretically in terms of the nite element solution, complementing the various known upper error bounds for re nement. These error bounds are used to determine where to insert and/or remov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005